Boundary Complexes of Convex Polytopes Cannot Be Characterized Locally
نویسنده
چکیده
It is well known that there is no local criterion to decide the linear readability of matroids or oriented matroids. We use the set-up of chirotopes or oriented matroids to derive a similar result in the context of convex polytopes. There is no local criterion to decide whether a combinatorial sphere is polytopal. The proof is based on a construction technique for rigid chirotopes. These correspond, in the realizable case, to convex polytopes whose internal combinatorial structure is completely determined by its face lattice. So, a rigid chirotope is realizable over a field F if and only if its face-lattice is F-polytopal. Furthermore we prove that for every proper subfield F of the field A of real algebraic numbers there exists a 6-polytope which is not realizable over F.
منابع مشابه
A Note on the Boundary Shape of Matrix Polytope Products
Motivated by interval matrix multiplication we consider (matrix) polytopes A ⊆ R, B ⊆ R, m,n, k ∈ N, and investigate the boundary shape of their pointwise product AB := {AB | A ∈ A, B ∈ B}. We prove that AB cannot have outward curved boundary sections while inward curved sections may exist. This is achieved by a simple local extreme point analysis. Results are proved in a more general abstract ...
متن کاملOn locally convex PL-manifolds and fast verification of convexity
We show that a PL-realization of a closed connected manifold of dimension n − 1 in R (n ≥ 3) is the boundary of a convex polyhedron if and only if the interior of each (n− 3)-face has a point, which has a neighborhood lying on the boundary of a convex n-dimensional body. This result is derived from a generalization of Van Heijenoort’s theorem on locally convex manifolds to the spherical case. O...
متن کاملTiling Three-space by Combinatorially Equivalent Convex Polytopes
The paper settles a problem of Danzer, Griinbaum, and Shephard on tilings by convex polytopes. We prove that, for a given three-dimensional convex polytope P, there is a locally finite tiling of the Euclidean three-space by convex polytopes each combinatorially equivalent to P. In general, face-to-face tilings will not exist.
متن کاملTotal Curvature and Spiralling Shortest Paths
This paper gives a partial confirmation of a conjecture of Agarwal, Har-Peled, Sharir, and Varadarajan that the total curvature of a shortest path on the boundary of a convex polyhedron in R3 cannot be arbitrarily large. It is shown here that the conjecture holds for a class of polytopes for which the ratio of the radii of the circumscribed and inscribed ball is bounded. On the other hand, an e...
متن کاملFace Numbers of Complexes and Polytopes
Introduction. Let C be a finite polyhedral complex, i.e., a finite nonempty collection of convex polytopes in R such that (i) when P,Q E C then P flQ is a face of both and (ii) if P E C and Q is a face of P then Q EC. Let fi = fa(C) be the number of i-dimensional members of C, i > 0, called the iih face number. The discovery that the numbers fi are governed by interesting relations is due to Eu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1987